Realizability of Graphs
نویسندگان
چکیده
منابع مشابه
Realizability of Graphs and Linkages
We show that deciding whether a graph with given edge lengths can be realized by a straight-line drawing has the same complexity as deciding the truth of sentences in the existential theory of the real numbers, ETR; we introduce the class ∃R that captures the computational complexity of ETR and many other problems. The graph realizability problem remains ∃R-complete if all edges have unit lengt...
متن کاملRealizability of Fault Tolerant Graphs∗
A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....
متن کاملRealizability and Veri cation of MSC Graphs
Scenario-based speciications such as message sequence charts (MSC) ooer an intuitive and visual way of describing design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are known to be decidable for the class of bounded MSC-graphs. Our...
متن کاملRealizability and Verification of MSC Graphs
Scenario-based specifications such as message sequence charts (MSC) offer an intuitive and visual way to describe design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are undecidable for MSC-graphs in general, but are known to be dec...
متن کاملThe Complexity of Several Realizability Problems for Abstract Topological Graphs
topological graph (AT-graph): A = (G, R); G = (V, E) is a graph, R ⊆ ( E 2 ) in a topological graph T ... RT = set of crossing pairs of edges AT-graph A is realizable if there exists a topological graph T which is a drawing of G and RT = R. simply realizable ... T is simple rectilinearly realizable ... edges of T are straight-line segments weakly realizable ... RT ⊆ R Abstract topological graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2007
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-006-1284-5